Hereditary radical classes of linearly ordered groups
نویسندگان
چکیده
منابع مشابه
Pattern classes of permutations via bijections between linearly ordered sets
A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e. indecomposable as a union of proper subclasses, has a representation as the set of subpermutations of a bijection between two countable (or finite) linearly ordered sets A and B. Concentrating on the situation ...
متن کاملArchimedean - like Classes of Lattice - Ordered Groups
Suppose <? denotes a class of totally ordered groups closed under taking subgroups and quotients by o-homomorphisms. We study the following classes: (1) Res (£?), the class of all lattice-ordered groups which are subdirect products of groups in C; (2) Hyp(C), the class of lattice-ordered groups in Res(C) having all their ¿-homomorphic images in Res(<?); Para(C), the class of lattice-ordered gro...
متن کاملLinearly Ordered Topological Spaces
This work is devoted to the study of certain cardinality modifications of paracompactness and compactness in the setting of linearly ordered spaces. Some of the concepts treated here have previously been studied by Aquaro [l]1, Gulden [4], Kennison [5], Mansfield [6], Morita [7], and Poppe [9]. On the other hand, the concept of m-boundedness, introduced in §2, is new. Our main results (Theorems...
متن کاملAutomorphisms of Powers of Linearly Ordered Sets
Let I = ([0; 1];_;^; 0; 1), where _ and ^ are max and min, respectively. This algebra is the basic building block of fuzzy set theory and logic. Likewise, the algebra I = ([0; 1];_;^; 0; 1), where [0; 1] = f(a; b) : a; b 2 [0; 1], a bg, _, ^ are given coordinate-wise, and 0 and 1 are the bounds on [0; 1], is the relevant algebra for interval-valued fuzzy set theory and logic. A good share of th...
متن کاملParsing Using Linearly Ordered Phonological Rules
A generate and test algorithm is described which parses a surface form into one or more lexical entries using linearly ordered phonological rules. This algorithm avoids the exponential expansion of search space which a naive parsing algorithm would face by encoding into the form being parsed the ambiguities which arise during parsing. The algorithm has been implemented and tested on real langua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1983
ISSN: 0528-2195
DOI: 10.21136/cpm.1983.108408